Clonal Selection of Artificial Immune System for Solving the Capacitated Vehicle Routing Problem

نویسندگان

  • Warattapop Chainate
  • Pupong Pongcharoen
  • Peeraya Thapatsuwan
چکیده

Vehicle routing is one of the crucial logistic activities for delivering goods or services. This paper demonstrates the application of the clonal selection of Artificial Immune System (AIS), Generalized Evolutionary Walk Algorithm (GEWA) and Genetic Algorithm (GA) for solving capacitated vehicle routing problem (CVRP). The optimal parameter settings of the proposed algorithms were investigated using statistical design and analysis of experiment. Sequentially, the performances of the proposed algorithms were compared using twenty benchmarking CVRP instant datasets. The results showed that the parameters of each algorithm were statistically significant with a 95% confidence interval. It was found that the best-so-far solutions obtained from the AIS were up to 71.4% more efficient than those produced by the GEWA and GA for all problem sizes but the AIS required longer computational time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version

Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...

متن کامل

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

متن کامل

Modelling and Solving the Capacitated Location-Routing Problem with Simultaneous Pickup and Delivery Demands

In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...

متن کامل

Cuckoo search via Lévy flights for the capacitated vehicle routing problem

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

متن کامل

A Hybrid Clonal Selection Algorithm for the Vehicle Routing Problem with Stochastic Demands

The Clonal Selection Algorithm is the most known algorithm inspired from the Artificial Immune Systems and used effectively in optimization problems. In this paper, this nature inspired algorithm is used in a hybrid scheme with other metaheuristic algorithms for successfully solving the Vehicle Routing Problem with Stochastic Demands (VRPSD). More precisely, for the solution of this problem, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013